package com.lxl.todo;

import java.util.HashMap;
import java.util.Set;

/**
 * @Author: luoxianliang
 * @Email: 1322342586@qq.com
 * @CreateTime: 2025-08-13
 * @Description: 前 K 个高频元素
 * @Version: 1.0
 * @OtherInfo:
 */

/*public class Solution31 {
    public int[] topKFrequent(int[] nums, int k) {
        HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
        for (int i = 0; i < nums.length; i++) {
            map.put(nums[i],map.getOrDefault(nums[i],0) + 1);
        }
        Set<Integer> integers = map.keySet();
        for (int num : integers) {
            if () {
            }
        }
    }

}*/
